//到目标元素的最小距离
//思路：O（n）遍历数组	
int getMinDistance(int* nums, int numsSize, int target, int start) {
	int i, min, count;
	count = 0;
	for (i = 0; i < numsSize; i++) {
		if (nums[i] == target) {
			if (count == 0){
				min = abs(i - start);
				count = 1;
			}
			min = min < abs(i - start) ? min : abs(i - start);
		}
	}
	return min;
}